package com.leet.meituan;

import java.util.Scanner;
import java.util.*;
public class PaiLie {

        static int mod = 998244353;

        public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
            int n = in.nextInt();
            int m = in.nextInt();
            int res = 0;
            int[][] f = new int[m + 1][n + 1];
            for (int i = 0; i <= n; i++) f[1][i] = 1;

            for (int i = 2; i <= m; i++) {
                for (int j = 1; j <= n; j++) {
                    for (int k = j; k <= n; k += j) {
                        f[i][k] = (f[i][k] + f[i - 1][j]) % mod;
                    }
                }
            }
            for (int i = 1; i <= n; i++) {
                res = (res + f[m][i]) % mod;
            }
            System.out.println(res);
        }
    }

